Multi-Resolution Approximate Inverses
نویسندگان
چکیده
I hereby declare that I am the sole author of this thesis. I authorize the University of Waterloo to lend this thesis to other institutions or individuals for the purpose of scholarly research. I further authorize the University of Waterloo to reproduce this thesis by photocopying or by other means, in total or in part, at the request of other institutions or individuals for the purpose of scholarly research. ii The University of Waterloo requires the signatures of all persons using or photocopying this thesis. Please sign below, and give address and date. This thesis presents a new preconditioner for elliptic PDE problems on unstructured meshes. Using ideas from second generation wavelets, a multi-resolution basis is constructed to effectively compress the inverse of the matrix, resolving the sparsity vs. quality problem of standard approximate inverses. This finally allows the approximate inverse approach to scale well, giving fast convergence for Krylov subspace accelerators on a wide variety of large unstructured problems. Implementation details are discussed, including ordering and construction of fac-tored approximate inverses, discretization and basis construction in one and two dimensions, and possibilities for parallelism. The numerical experiments in one and two dimensions confirm the capabilities of the scheme. Along the way I highlight many new avenues for research, including the connections to multigrid and other multi-resolution schemes. iv Acknowledgements I would like to first thank Wei-Pai Tang for his excellent ideas, support, and guidance. I'm also indebted to Peter Forsyth for advice on discretization and multigrid, and very helpful suggestions for revisions; to Sivabal Sivaloganathan for introducing me to Green's functions and reading the drafts; to Rob Zvan for getting me started on irregular meshes; to Justin Wan for some fruitful conversations and sample meshes; to David Pooley for the barrier option pricing problem; and of course to the Natural Sciences and Engineering Research Council of Canada for their financial support. I especially want to thank my family for their much needed love and encouragement throughout the last year and particularly the final hectic weeks.
منابع مشابه
Improving approximate inverses based on Frobenius norm minimization
Approximate inverses, based on Frobenius norm minimization, of real nonsingular matrices are analyzed from a purely theoretical point of view. In this context, this paper provides several sufficient conditions, that assure us the possibility of improving (in the sense of the Frobenius norm) some given approximate inverses. Moreover, the optimal approximate inverses of matrix A ∈ R, among all ma...
متن کاملCertain Sums Involving Inverses of Binomial Coefficients and Some Integrals
In this paper, we are concerned with sums involving inverses of binomial coefficients. We study certain sums involving reciprocals of binomial coefficients by using some integrals. Some recurrence relations related to inverses of binomial coefficients are obtained. In addition, we give the approximate values of certain sums involving the inverses of binomial coefficients.
متن کاملParallel Smoothers Using Sparse Approximate Inverse
Sparse approximate inverses' usefulness in a parallel environment has motivated much interest in recent years. However, the superior capability of an approximate inverse in eliminating the local error has not yet been fully exploited in multi-grid algorithms. We propose a new class of sparse approximate inverse smoothers in this paper and present their analytic smoothing factors for constant co...
متن کاملUsing approximate inverses in algebraic multilevel methods
This paper deals with the iterative solution of large sparse symmetric positive definite systems. We investigate preconditioning techniques of the two-level type that are based on a block factorization of the system matrix. Whereas the basic scheme assumes an exact inversion of the submatrix related to the first block of unknowns, we analyze the effect of using an approximate inverse instead. W...
متن کاملWavelet Sparse Approximate Inverse Preconditioners
There is an increasing interest in using sparse approximate inverses as preconditioners for Krylov subspace iterative methods. Recent studies of Grote and Huckle [21] and Chow and Saad [11] also show that sparse approximate inverse preconditioner can be effective for a variety of matrices, e.g. Harwell-Boeing collections. Nonetheless a drawback is that it requires rapid decay of the inverse ent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999